Generating new classes of fixed-time stable systems with predefined upper bound for the settling time

نویسندگان

چکیده

This paper aims to provide a methodology for generating autonomous and non-autonomous systems with fixed-time stable equilibrium point where an Upper Bound of the Settling Time (UBST) is set priori as parameter system. In addition, some conditions such upper bound be least one are provided. construction procedure relevant contribution when compared traditional methodologies algorithms satisfying time constraints since current estimates UBST may too conservative. The proposed based on time-scale transformations Lyapunov analysis. It allows presentation broad class predefined UBST, placing them under common framework existing methods using time-varying gains. To illustrate effectiveness our approach, we generate novel, non-autonomous, UBST.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Branch-and-Bound for the Problem of Mean Completion Time for the Single Machine with Release Time

Preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. In this paper, the same problem has been considered in which objective is to minimize the mean flow time. To prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. O...

متن کامل

Delay-Dependent Robust Asymptotically Stable for Linear Time Variant Systems

In this paper, the problem of delay dependent robust asymptotically stable for uncertain linear time-variant system with multiple delays is investigated. A new delay-dependent stability sufficient condition is given by using the Lyapunov method, linear matrix inequality (LMI), parameterized first-order model transformation technique and transformation of the interval uncertainty in to the norm ...

متن کامل

a new branch-and-bound for the problem of mean completion time for the single machine with release time

preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. in this paper, the same problem has been considered in which objective is to minimize the mean flow time. to prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. o...

متن کامل

Stable Rough Extreme Learning Machines for the Identification of Uncertain Continuous-Time Nonlinear Systems

‎Rough extreme learning machines (RELMs) are rough-neural networks with one hidden layer where the parameters between the inputs and hidden neurons are arbitrarily chosen and never updated‎. ‎In this paper‎, ‎we propose RELMs with a stable online learning algorithm for the identification of continuous-time nonlinear systems in the presence of noises and uncertainties‎, ‎and we prove the global ...

متن کامل

a time-series analysis of the demand for life insurance in iran

با توجه به تجزیه و تحلیل داده ها ما دریافتیم که سطح درامد و تعداد نمایندگیها باتقاضای بیمه عمر رابطه مستقیم دارند و نرخ بهره و بار تکفل با تقاضای بیمه عمر رابطه عکس دارند

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Control

سال: 2021

ISSN: ['0020-7179', '1366-5820']

DOI: https://doi.org/10.1080/00207179.2021.1936190